Browsing by Subject "Distributed strategies"

Now showing items 1-3 of 3

    • Article  

      Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum 

      Charalambous, T.; Rabbat, M. G.; Johansson, M.; Hadjicostis, Christoforos N. (2016)
      Many of the algorithms that have been proposed in the field of distributed computation rely on assumptions that require nodes to be aware of some global parameters. In this paper, we propose algorithms to compute some ...
    • Conference Object  

      Distributed strategies for average consensus in directed graphs 

      Domínguez-Garcia, A. D.; Hadjicostis, Christoforos N. (2011)
      We address the average consensus problem for a distributed system whose components (nodes) can exchange information via interconnections (links) that form an arbitrary, strongly connected but possibly directed, topology ...
    • Conference Object  

      Distributed strategies for balancing a weighted digraph 

      Hadjicostis, Christoforos N.; Rikos, A. (2012)
      A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role ...